Formal L-concepts with Rough Intents
نویسندگان
چکیده
We provide a new approach to synthesis of Formal Concept Analysis and Rough Set Theory. In this approach, the formal concept is considered to be a collection of objects accompanied with two collections of attributes—those which are shared by all the objects and those which are possessed by at least one of the objects. We define concept-forming operators for these concepts and describe their properties. Furthermore, we deal with reduction of the data by rough approximation by given equivalence. The results are elaborated in a fuzzy setting.
منابع مشابه
The Maximal Relation Based on A Given Relation Schema and Its Concept Lattice
Formal concept analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies concept lattices from binary relations. Given a nonempty finite set A of binary attributes, one obtains a maximal binary relation R based on a relation schema S(A). Firstly, we analyze concepts in R and the concept lattice L(R), and there are some important results as follows: for any two con...
متن کاملA Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis
The theory of rough sets and formal concept analysis are compared in a common framework based on formal contexts. Different concept lattices can be constructed. Formal concept analysis focuses on concepts that are definable by conjuctions of properties, rough set theory focuses on concepts that are definable by disjunctions of properties. They produce different types of rules summarizing knowle...
متن کاملAn Extended Branch and Bound Search Algorithm for Finding Top- N Formal Concepts of Documents
This paper presents a branch and bound search algorithm for finding only top N number of extents of formal concepts w.r.t. their evaluation, where the corresponding intents are under some quality control. The algorithm aims at finding potentially interesting documents of even lower evaluation values that belong to some highly evaluated formal concept. The experimental results show that it can e...
متن کاملFinding Exception for Association Rules via Sql Queries
Finding association rules is mainly based on generating larger and larger frequent set candidates, starting from frequent attributes in the database. The frequent sets can be organised as a part of a lattice of concepts according to the Formal Concept Analysis approach. Since the lattice construction is database contents-dependent, the pseudo-intents (see Formal Concept Analysis) are avoided. A...
متن کاملConcept Approximations Based on Rough Sets and Similarity Measures
The formal concept analysis gives a mathematical definition of a formal concept. However, in many real-life applications, the problem under investigation cannot be described by formal concepts. Such concepts are called the non-definable concepts (Saquer and Deogun, 2000a). The process of finding formal concepts that best describe non-definable concepts is called the concept approximation. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014